Strong Convergence of Quantum Random Walks Via Semigroup Decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aperiodic quantum random walks.

We generalize the quantum random walk protocol for a particle in a one-dimensional chain, by using several types of biased quantum coins, arranged in aperiodic sequences, in a manner that leads to a rich variety of possible wave-function evolutions. Quasiperiodic sequences, following the Fibonacci prescription, are of particular interest, leading to a sub-ballistic wave-function spreading. In c...

متن کامل

Open Quantum Random Walks

A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogue of classical Markov chains. We explore the “quantum trajectory” point of view on these quantum random walks, that is, we show that measuring the position of the particle after each times...

متن کامل

Amenability via random walks

We use random walks to show that the Basilica group is amenable, answering an open question of Grigorchuk and Żuk. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct limits; these classes are separated even within the realm of finitely presented groups.

متن کامل

Convergence of Random Walks and Conductance - Draft

I present a bound on the rate of convergence of random walks in graphs that depends upon the conductance. This proof was developed by Lovàsz and Simonovits [LS90]. The name " holistic " is my fault. First, it's just cool. Second, it is very different from the spectral proof, and so is likely to extend to different situations. Third, it has algorithmic applications that the spectral proof does n...

متن کامل

Quantum random walks in one dimension via generating functions

We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip matrices. Using a multivariate generating function analysis we give a simplified proof of a known phenomenon, namely that the walk has linear speed rather than the diffusive behavior observed in classical random walks. We also obtain exact formulae for the leading asymptotic term of the wave functi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Henri Poincaré

سال: 2018

ISSN: 1424-0637,1424-0661

DOI: 10.1007/s00023-018-0676-4